ILIN : An Implementation of the Integer Labeling Algorithm for Integer Programming

In a recent paper, Yang proposes an integer labeling algorithm for determining whether an arbitrary simplex P in R n contains an integer point or not. The problem under consideration is a very di cult one in the sense that it is NPcomplete. The algorithm is based on a speci c integer labeling rule and a speci c triangulation of R n . In this paper we discuss a practical implementation of the algorithm and present a computer program (ILIN) for solving integer programming using integer labeling algorithm. We also report on the solution of a number of tested examples with up to 500 integer variables. Numerical results indicate that the algorithm is computationally simple, exible, e cient and stable. key words: Simplex, integer point, integer labeling algorithm, integer linear programming